Axiomatizing core extensions

نویسندگان

  • Camelia Bejan
  • Juan Camilo Gómez
چکیده

We give an axiomatization of the aspiration core on the domain of all TU-games using a relaxed feasibility condition, non-emptiness, individual rationality, and generalized versions of the reduced game property (consistency) and superadditivity. Our axioms also characterize the C-core ([Guesnerie and Oddou, 1979] and [Sun, Trockel, and Yang, 2008]) and the core on appropriate subdomains. The latter result generalizes Peleg’s (1986) axiomatization to the entire family of TU-games.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Exploration by Confidence with Completely Specified Counterexamples

We present an extensions of our previous work on axiomatizing confident general concept inclusions in given finite interpretations. Within this extension we allow external experts to interactively provide counterexamples to general concept inclusions with otherwise enough confidence in the given data. This extensions allows us to distinguish between erroneous counterexamples in the data and rar...

متن کامل

بررسی تطبیقی سیر تکامل و ساختار سیستم های نامگذاری نظام یافته پزشکی SNOMED در کشورهای آمریکا ، انگلستان و استرالیا 86-85

Background and Aim: Systematized Nomenclature of Medicine systems are the important supportive for electronic health record in registration and retrieval of data. Systematized Nomenclature of Medicine - Clinical Terms (SNOMED CT) is the most comprehensive language and then the consistency of exchanged data across health care providers and finally the high effectiveness of health care. Material...

متن کامل

IBM PowerPC 440 FPU with complex-arithmetic extensions

The PowerPCt 440 floating-point unit (FPU) with complexarithmetic extensions is an embedded application-specific integrated circuit (ASIC) core designed to be used with the IBM PowerPC 440 processor core on the Blue Genet/L compute chip. The FPU core implements the floating-point instruction set from the PowerPC Architecturee and the floating-point instruction extensions created to aid in matri...

متن کامل

Axiomatizing St Bisimulation for a Process Algebra with Recursion and Action Reenement (extended Abstract)

Due to the complex nature of bisimulation equivalences which express some form of history dependence, it turned out to be problematic to axiomatize them for non trivial classes of systems. Here we introduce the idea of \compositional level-wise renaming" which gives rise to the new possibility of axiomatizing the class of history dependent bisimulations with slight modiications to the machinery...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2012